A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
نویسندگان
چکیده
منابع مشابه
A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
The cutting plane tree (CPT) algorithm provides a finite disjunctive programming procedure to obtain the solution of general mixed-integer linear programs (MILP) with bounded integer variables. In this paper, we present our computational experience with variants of the CPT algorithm. Because the CPT algorithm is based on discovering multi-term disjunctions, this paper is the first to present co...
متن کاملA Computational Study of Finitely Convergent Polyhedral Methods for General Mixed-Integer Linear Programs
Recently, Chen et al. (2009) proposed a finite polyhedral characterization of the convex hull of solutions to general mixed integer linear programs with bounded integer variables and introduced finitely convergent algorithms to solve this class of problems. In this paper, we investigate whether these algorithms provide computational tools that go beyond the convergence results reported in the a...
متن کاملFinite Disjunctive Programming Methods for General mixed Integer linear Programs
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 CHAPTER
متن کاملFinite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely convergent convex hull tree algorithm which constructs a linear program that has the same optimal solution as the associated MILP. In addition, we combine the standard notion of sequential cutting planes...
متن کاملCutting planes for integer programs with general integer variables
We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 0{1 variables. We also explore the use of Gomory's mixed integer cuts. We address both theoretical and computational issues and show how to embed these cutting planes in a branch-and-bound framew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2012
ISSN: 0167-6377
DOI: 10.1016/j.orl.2011.10.009